Linear discriminant analysis with a generalization of the Moore-Penrose pseudoinverse
نویسندگان
چکیده
The Linear Discriminant Analysis (LDA) technique is an important and well-developed area of classification, and to date many linear (and also nonlinear) discrimination methods have been put forward. A complication in applying LDA to real data occurs when the number of features exceeds that of observations. In this case, the covariance estimates do not have full rank, and thus cannot be inverted. There are a number of ways to deal with this problem. In this paper, we propose improving LDA in this area, and we present a new approach which uses a generalization of the Moore–Penrose pseudoinverse to remove this weakness. Our new approach, in addition to managing the problem of inverting the covariance matrix, significantly improves the quality of classification, also on data sets where we can invert the covariance matrix. Experimental results on various data sets demonstrate that our improvements to LDA are efficient and our approach outperforms LDA.
منابع مشابه
Regularized Discriminant Analysis, Ridge Regression and Beyond
Fisher linear discriminant analysis (FDA) and its kernel extension—kernel discriminant analysis (KDA)—are well known methods that consider dimensionality reduction and classification jointly. While widely deployed in practical problems, there are still unresolved issues surrounding their efficient implementation and their relationship with least mean squares procedures. In this paper we address...
متن کاملA generalization of the Moore-Penrose inverse related to matrix subspaces of Cn×m
A natural generalization of the classical Moore-Penrose inverse is presented. The so-called S-Moore-Penrose inverse of a m × n complex matrix A, denoted by AS, is defined for any linear subspace S of the matrix vector space Cn×m. The S-Moore-Penrose inverse AS is characterized using either the singular value decomposition or (for the nonsingular square case) the orthogonal complements with resp...
متن کاملComparison of statistical pattern-recognition algorithms for hybrid processing. I. Linear-mapping algorithms
Two groups of pattern-recognition algorithms for hybrid optical-digital computer processing are theoretically and experimentally compared. The first group is based on linear mapping, while the second group is based on feature extraction and eigenvector analysis. We study the relations among various linear-mapping-based algorithms by formulating a more general unified pseudoinverse algorithm. We...
متن کاملA Generalization of Moore–penrose Biorthogonal Systems * Masaya Matsuura †
In this paper, the notion of Moore–Penrose biorthogonal systems is generalized. In [Fiedler, Moore–Penrose biorthogonal systems in Euclidean spaces, Lin. Alg. Appl. 362 (2003), pp. 137–143], transformations of generating systems of Euclidean spaces are examined in connection with the Moore-Penrose inverses of their Gram matrices. In this paper, g-inverses are used instead of the Moore–Penrose i...
متن کاملImage Reconstruction Methods for MATLAB Users - A Moore-Penrose Inverse Approach
In the last decades the Moore-Penrose pseudoinverse has found a wide range of applications in many areas of Science and became a useful tool for different scientists dealing with optimization problems, data analysis, solutions of linear integral equations, etc. At first we will present a review of some of the basic results on the so-called Moore-Penrose pseudoinverse of matrices, a concept that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computer Science
دوره 23 شماره
صفحات -
تاریخ انتشار 2013